HMM: A Static Mapping Algorithm to Map Parallel Applications on Grids
نویسندگان
چکیده
In this paper we present a static mapping heuristic, called Heterogeneous Multi-phase Mapping (HMM), which allows a suboptimal mapping of a parallel program onto a metacomputer to minimize the program execution time. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application. Moreover, it uses a local search technique together with the tabu search meta-heuristic. The experimental results show that the proposed approach performs well promising a significant potential to develop efficient mapping solutions for metacomputers.
منابع مشابه
A Static Mapping Heuristic for Mapping Parallel Applications to Heterogeneous Computing Systems
To minimize the execution time of a parallel application running on a heterogeneous computing distributed system, an appropriate mapping scheme to allocate the application tasks to the processors is needed. The general problem of mapping tasks to machines is a well known NP-hard problem and several heuristics have been proposed to approximate its optimal solution. In this paper we propose a sta...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملMapping Robust Parallel Multigrid Algorithms
SUMMARY The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite diicult to map eeectively to highly parallel architectures. Newer multigrid algorith...
متن کاملTowards Mapping Dynamic Environments
We propose an algorithm for mapping dynamic environments. Our algorithm creates a representation of the environment where objects move over time. Our approach is based on maintaining two occupancy grids in parallel. One grid models the static parts of the environment, and the other models the dynamic parts of the environment. The union of the two provides a complete description of the environme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005